Relational retrieval using a combination of path-constrained random walks
نویسندگان
چکیده
منابع مشابه
Contextual Recommendation with Path Constrained Random Walks
Recommendation has become an increasingly important research area because of the abundance of online documents and shopping opportunities. The readily available context information for these tasks posts challenges to recommendation systems to deal with heterogeneous and inter-connected problem spaces. In this study, we use a graph representation for publication databases with rich meta-data. Wi...
متن کاملWord Segmentation in Sanskrit Using Path Constrained Random Walks
In Sanskrit, the phonemes at the word boundaries undergo changes to form new phonemes through a process called as sandhi. A fused sentence can be segmented into multiple possible segmentations. We propose a word segmentation approach that predicts the most semantically valid segmentation for a given sentence. We treat the problem as a query expansion problem and use the path-constrained random ...
متن کاملLearning Relational Features with Backward Random Walks
A path learning algorithm (PRA) has been recently proposed that addresses link prediction tasks on heterogenous graphs using learned combinations of labeled paths. Unlike most statistical relational learning methods, this approach scales to large data sets. In this paper, we extend PRA is terms of expressive power, while maintaining its high scalability. Mainly, we propose to compute backward r...
متن کاملLearning Relational Features with Backward Random Walks
The path ranking algorithm (PRA) has been recently proposed to address relational classification and retrieval tasks at large scale. We describe Cor-PRA, an enhanced system that can model a larger space of relational rules, including longer relational rules and a class of first order rules with constants, while maintaining scalability. We describe and test faster algorithms for searching for th...
متن کاملPath probabilities of continuous time random walks
Employing the path integral formulation of a broad class of anomalous diffusion processes, we derive the exact relations for the path probability densities of these processes. In particular, we obtain a closed analytical solution for the path probability distribution of a Continuous Time Random Walk (CTRW) process. This solution is given in terms of its waiting time distribution and short time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2010
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-010-5205-8